A Generic Scheme for Integrating Strong Local Consistencies into Constraint Solvers
نویسندگان
چکیده
This article presents a generic scheme for adding strong local consistencies to the set of features of constraint solvers, which is notably applicable to event-based constraint solvers. We encapsulate a subset of constraints into a global constraint. This approach allows a solver to use different levels of consistency for different subsets of constraints in the same model. Moreover, we show how strong consistencies can be applied with different kinds of constraints, including user-defined constraints. We experiment our technique with a coarse-grained algorithm for Max-RPC, called Max-RPC and a variant of it, L-Max-RPC. Experiments confirm the interest of strong consistencies for Constraint Programming tools.
منابع مشابه
Integrating Strong Local Consistencies into Constraint Solvers
This article presents a generic scheme for adding strong local consistencies to the set of features of constraint solvers, which is notably applicable to event-based constraint solvers. We encapsulate a subset of constraints into a global constraint. This approach allows a solver to use different levels of consistency for different subsets of constraints in the same model. Moreover, we show how...
متن کاملEfficient Algorithms for Strong Local Consistencies in Constraint Satisfaction Problems
The existing complete methods for solving Constraint Satisfaction Problems (CSPs) are usually based on a combination of exhaustive search and constraint propagation techniques for the reduction of the search space. Such propagation techniques are the local consistency algorithms. Arc Consistency (AC) and Generalized Arc Consistency (GAC) are the most widely studied local consistencies that are ...
متن کاملStrong Domain Filtering Consistencies for Non-Binary Constraint Satisfaction Problems
Domain filtering local consistencies, such as inverse consistencies, that only delete values and do not add new constraints are particularly useful in Constraint Programming. Although many such consistencies for binary constraints have been proposed and evaluated, the situation with non-binary constraints is quite different. Only very recently have domain filtering consistencies stronger than G...
متن کاملSecond-Order Consistencies
In this paper, we propose a comprehensive study of second-order consistencies (i.e., consistencies identifying inconsistent pairs of values) for constraint satisfaction. We build a full picture of the relationships existing between four basic second-order consistencies, namely path consistency (PC), 3-consistency (3C), dual consistency (DC) and 2-singleton arc consistency (2SAC), as well as the...
متن کاملSolving Continuous Constraint Systems
This paper provides an overview of the constraint techniques for solving non-linear systems of equations over the real numbers. It introduces the main concepts behind the different pruning techniques and searching strategies implemented in the most famous constraint solvers over continuous domains. Local consistencies are a key issue in finite domains where arc-consistency is very popular. Howe...
متن کامل